Minimum Clique Number, Chromatic Number, and Ramsey Numbers
نویسنده
چکیده
Let Q(n, c) denote the minimum clique number over graphs with n vertices and chromatic number c. We investigate the asymptotics of Q(n, c) when n/c is held constant. We show that when n/c is an integer α, Q(n, c) has the same growth order as the inverse function of the Ramsey number R(α+ 1, t) (as a function of t). Furthermore, we show that if certain asymptotic properties of the Ramsey numbers hold, then Q(n, c) is in fact asymptotically equivalent to the aforementioned inverse function. We use this fact to deduce that Q(n, dn/3e) is asymptotically equivalent to the inverse function of R(4, t).
منابع مشابه
Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملLarge Chromatic Number and Ramsey Graphs
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ . Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملThe chromatic gap and its extremes
The chromatic gap is the difference between the chromatic number and the clique number of a graph. Here we investigate gap(n), the maximum chromatic gap over graphs on n vertices. Can the extremal graphs be explored? While computational problems related to the chromatic gap are hopeless, an interplay between Ramsey theory and matching theory leads to a simple and (almost) exact formula for gap(...
متن کاملOn the Size-Ramsey Number of Hypergraphs
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012